Multiplicity one theorems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Certain Multiplicity One Theorems

We prove several multiplicity one theorems in this paper. For k a local field not of characteristic two, and V a symplectic space over k, any irreducible admissible representation of the symplectic similitude group GSp(V ) decomposes with multiplicity one when restricted to the symplectic group Sp(V ). We prove the analogous result for GO(V ) and O(V ), where V is an orthogonal space over k. Wh...

متن کامل

Finite multiplicity theorems

We find upper and lower bounds of the multiplicities of irreducible admissible representations π of a semisimple Lie group G occurring in the induced representations IndH τ from irreducible representations τ of a closed subgroup H. As corollaries, we establish geometric criteria for finiteness of the dimension of HomG(π, Ind G H τ) (induction) and of HomH(π|H , τ) (restriction) by means of the ...

متن کامل

Kostka multiplicity one for multipartitions

If [λ(j)] is a multipartition of the positive integer n (a sequence of partitions with total size n), and μ is a partition of n, we study the number K[λ(j)]μ of sequences of semistandard Young tableaux of shape [λ(j)] and total weight μ. We show that the numbers K[λ(j)]μ occur naturally as the multiplicities in certain permutation representations of wreath products. The main result is a set of ...

متن کامل

The Euler multiplicity and addition-deletion theorems for multiarrangements

The addition-deletion theorems for hyperplane arrangements, which were originally shown in [T1], provide useful ways to construct examples of free arrangements. In this article, we prove addition-deletion theorems for multiarrangements. A key to the generalization is the definition of a new multiplicity, called the Euler multiplicity, of a restricted multiarrangement. We compute the Euler multi...

متن کامل

The e-multiplicity and addition-deletion theorems for multiarrangements

The addition-deletion theorems for hyperplane arrangements, which were originally shown in [T1], provide useful ways to construct examples of free arrangements. In this article, we prove addition-deletion theorems for multiarrangements. A key to the generalization is the definition of a new multiplicity, called the e-multiplicity, of a restricted multiarrangement. We compute the e-multiplicitie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Mathematics

سال: 2010

ISSN: 0003-486X

DOI: 10.4007/annals.2010.172.1407